Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Complexity of Constraints [[electronic resource] ] : An Overview of Current Research Themes / / edited by Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
| Complexity of Constraints [[electronic resource] ] : An Overview of Current Research Themes / / edited by Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 321 p.) |
| Disciplina | 004.33 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Artificial intelligence Computer graphics Programming Techniques Data Science Discrete Mathematics in Computer Science Artificial Intelligence Computer Graphics |
| ISBN | 3-540-92800-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? -- Basics of Galois Connections -- Recent Results on the Algebraic Approach to the CSP -- Dualities for Constraint Satisfaction Problems -- A Logical Approach to Constraint Satisfaction -- Uniform Constraint Satisfaction Problems and Database Theory -- Constraint Satisfaction Problems with Infinite Templates -- Partial Polymorphisms and Constraint Satisfaction Problems -- to the Maximum Solution Problem -- Present and Future of Practical SAT Solving. |
| Record Nr. | UNISA-996465424103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Complexity of Constraints [[electronic resource] ] : An Overview of Current Research Themes / / edited by Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer
| Complexity of Constraints [[electronic resource] ] : An Overview of Current Research Themes / / edited by Nadia Creignou, Phokion G. Kolaitis, Heribert Vollmer |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (VII, 321 p.) |
| Disciplina | 004.33 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer programming
Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Artificial intelligence Computer graphics Programming Techniques Data Science Discrete Mathematics in Computer Science Artificial Intelligence Computer Graphics |
| ISBN | 3-540-92800-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? -- Basics of Galois Connections -- Recent Results on the Algebraic Approach to the CSP -- Dualities for Constraint Satisfaction Problems -- A Logical Approach to Constraint Satisfaction -- Uniform Constraint Satisfaction Problems and Database Theory -- Constraint Satisfaction Problems with Infinite Templates -- Partial Polymorphisms and Constraint Satisfaction Problems -- to the Maximum Solution Problem -- Present and Future of Practical SAT Solving. |
| Record Nr. | UNINA-9910484217503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2016 [[electronic resource] ] : 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings / / edited by Nadia Creignou, Daniel Le Berre
| Theory and Applications of Satisfiability Testing – SAT 2016 [[electronic resource] ] : 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings / / edited by Nadia Creignou, Daniel Le Berre |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXIV, 564 p. 119 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Computer science—Mathematics Software engineering Theory of Computation Artificial Intelligence Mathematics of Computing Software Engineering |
| ISBN | 3-319-40970-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Parameterized Compilation Lower Bounds for Restricted CNF-formulas -- Satisfiability via Smooth Pictures -- Solution-Graphs of Boolean Formulas and Isomorphism -- Strong Backdoors for Default Logic -- The Normalized Autocorrelation Length of Max r-Sat Converges in Probability to (1-1/2=r)/r -- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle -- Extreme Cases in SAT Problems -- Improved Static Symmetry Breaking for SAT -- Learning Rate Based Branching Heuristic for SAT Solvers -- On the Hardness of SAT with Community Structure -- Trade-offs between Time and Memory in a Tighter Model of CDCL SAT Solvers -- A SAT Approach to Branch Width -- Computing Maximum Unavoidable Subgraphs Using SAT Solvers -- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT -- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer -- Deciding Bit-Vector Formulas with mcSAT -- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams -- Speeding Up the Constraint-Based Method in Difference Logic -- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers -- Finding Finite Models in Multi-Sorted First Order Logic -- MCS Extraction with Sublinear Oracle Queries -- Predicate Elimination for Preprocessing in First-Order Theorem Proving -- Quantified Boolean Formula Incremental Determinization -- Non-prenex QBF Solving using Abstraction -- On Q-Resolution and CDCL QBF Solving -- On Stronger Calculi for QBFs -- Q-Resolution with Generalized Axioms -- 2QBF: Challenges and Solutions -- Dependency Schemes for DQBF -- Lifting QBF Resolution Calculi to DQBF -- Long Distance Q-Resolution with Dependency Schemes -- BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies -- HordeQBF: A Modular and Massively Parallel QBF Solver -- LMHS: A SAT-IP Hybrid MaxSAT Solver -- OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing -- SpyBug: Automated Bug Detection in the Con_guration Space of SAT Solvers. . |
| Record Nr. | UNISA-996466004603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Satisfiability Testing – SAT 2016 [[electronic resource] ] : 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings / / edited by Nadia Creignou, Daniel Le Berre
| Theory and Applications of Satisfiability Testing – SAT 2016 [[electronic resource] ] : 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings / / edited by Nadia Creignou, Daniel Le Berre |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XXIV, 564 p. 119 illus.) |
| Disciplina | 511.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Artificial intelligence Computer science—Mathematics Software engineering Theory of Computation Artificial Intelligence Mathematics of Computing Software Engineering |
| ISBN | 3-319-40970-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Parameterized Compilation Lower Bounds for Restricted CNF-formulas -- Satisfiability via Smooth Pictures -- Solution-Graphs of Boolean Formulas and Isomorphism -- Strong Backdoors for Default Logic -- The Normalized Autocorrelation Length of Max r-Sat Converges in Probability to (1-1/2=r)/r -- Tight Upper Bound on Splitting by Linear Combinations for Pigeonhole Principle -- Extreme Cases in SAT Problems -- Improved Static Symmetry Breaking for SAT -- Learning Rate Based Branching Heuristic for SAT Solvers -- On the Hardness of SAT with Community Structure -- Trade-offs between Time and Memory in a Tighter Model of CDCL SAT Solvers -- A SAT Approach to Branch Width -- Computing Maximum Unavoidable Subgraphs Using SAT Solvers -- Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT -- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer -- Deciding Bit-Vector Formulas with mcSAT -- Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams -- Speeding Up the Constraint-Based Method in Difference Logic -- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers -- Finding Finite Models in Multi-Sorted First Order Logic -- MCS Extraction with Sublinear Oracle Queries -- Predicate Elimination for Preprocessing in First-Order Theorem Proving -- Quantified Boolean Formula Incremental Determinization -- Non-prenex QBF Solving using Abstraction -- On Q-Resolution and CDCL QBF Solving -- On Stronger Calculi for QBFs -- Q-Resolution with Generalized Axioms -- 2QBF: Challenges and Solutions -- Dependency Schemes for DQBF -- Lifting QBF Resolution Calculi to DQBF -- Long Distance Q-Resolution with Dependency Schemes -- BEACON: An Efficient SAT-Based Tool for Debugging EL+ Ontologies -- HordeQBF: A Modular and Massively Parallel QBF Solver -- LMHS: A SAT-IP Hybrid MaxSAT Solver -- OpenSMT2: An SMT Solver for Multi-Core and Cloud Computing -- SpyBug: Automated Bug Detection in the Con_guration Space of SAT Solvers. . |
| Record Nr. | UNINA-9910484801203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||